var bibbase_data = {"data":"<img src=\"//bibbase.org/img/ajax-loader.gif\" id=\"spinner\"\n  style=\"display: none;\" alt=\"Loading..\" />\n\n<div id=\"bibbase\">\n\n  <script type=\"text/javascript\">\n    var bibbase = {\n      params: {\"bib\":\"https://research.seas.ucla.edu/licos/files/2023/02/publicactions_v1.bib\",\"authorFirst\":\"1\",\"nocache\":\"1\",\"fullnames\":\"1\",\"theme\":\"bullets\",\"group0\":\"year\",\"group1\":\"type\",\"owner\":\"{}\",\"filter\":\"label:(dc_j01|dc_c97|ad_j01)\",\"jsonp\":\"1\",\"host\":\"bibbase.org\"},\n      data: [{\"bibtype\":\"article\",\"type\":\"2\",\"abstract\":\"Narrowband interference (NBI) could occur in transmission media such as twisted pair or coaxial cable. We analyzed the effect of such interference on the data throughput for finite-blocklength transmission over noisy inter-symbol interference channels. It was shown that the worst narrowband interference spreads its power over the “sweet spots” of the signal (i.e. where the signal puts highest power). More precisely, the auto-correlation matrix of worst-case narrowband (rank-deficient) interference is shown to have the same eigendirections as the signal. Moreover, if the rank of the covariance matrix of the NBI is M<N (where N is the rank of the signal and M is dimension of the space) then the worst interferer is shown to put its power along the M largest eigendirections of the signal.\",\"author\":[{\"firstnames\":[\"N.\"],\"propositions\":[],\"lastnames\":[\"Al-Dhahir\"],\"suffixes\":[]},{\"firstnames\":[\"S\",\"N.\"],\"propositions\":[],\"lastnames\":[\"Diggavi\"],\"suffixes\":[]}],\"file\":\":papers:ps:nbi.pdf\",\"journal\":\"IEEE Communication Letters\",\"label\":\"ad_j01\",\"month\":\"June\",\"note\":\"\",\"number\":\"6\",\"pages\":\"233–235\",\"tags\":\"journal,WorstNoise,RobComm,IT\",\"title\":\"Maximum Throughput Loss of Noisy ISI Channels Due to Narrowband Interference\",\"volume\":\"5\",\"year\":\"2001\",\"bibtex\":\"@article{ADj01,\\n abstract = {Narrowband interference (NBI) could occur in transmission media such as twisted pair or coaxial cable. We analyzed the effect of such interference on the data throughput for finite-blocklength transmission over noisy inter-symbol interference channels. It was shown that the worst narrowband interference spreads its power over the “sweet spots” of the signal (i.e. where the signal puts highest power). More precisely, the auto-correlation matrix of worst-case narrowband (rank-deficient) interference is shown to have the same eigendirections as the signal. Moreover, if the rank of the covariance matrix of the NBI is M<N (where N is the rank of the signal and M is dimension of the space) then the worst interferer is shown to put its power along the M largest eigendirections of the signal.},\\n author = {N. Al-Dhahir and S N. Diggavi},\\n file = {:papers:ps:nbi.pdf},\\n journal = {IEEE Communication Letters},\\n label = {ad_j01},\\n month = {June},\\n note = {},\\n number = {6},\\n pages = {233--235},\\n tags = {journal,WorstNoise,RobComm,IT},\\n title = {Maximum Throughput Loss of Noisy ISI Channels Due to Narrowband Interference},\\n type = {2},\\n volume = {5},\\n year = {2001}\\n}\\n\\n\",\"author_short\":[\"Al-Dhahir, N.\",\"Diggavi, S N.\"],\"key\":\"ADj01\",\"id\":\"ADj01\",\"bibbaseid\":\"aldhahir-diggavi-maximumthroughputlossofnoisyisichannelsduetonarrowbandinterference-2001\",\"role\":\"author\",\"urls\":{},\"metadata\":{\"authorlinks\":{}},\"html\":\"\"},{\"bibtype\":\"article\",\"type\":\"2\",\"abstract\":\"This paper started with a simple question: is the maximum entropy noise the worst noise for additive channels? In the case of scalar channels with a power constraint on the noise, this is true, as is well known. However, we show that in the vector case, with covariance constraints, the answer is yes and no. Yes, if the transmit power is large enough and no otherwise. Along the way we give a solution to the mutual information game with covariance constraints and show that Gaussian solutions form saddle points, but there could also be other saddlepoints. We also demonstrate that the information rates can be achieved using mismatched (Gaussian) decoders.\",\"author\":[{\"firstnames\":[\"S\",\"N.\"],\"propositions\":[],\"lastnames\":[\"Diggavi\"],\"suffixes\":[]},{\"propositions\":[],\"lastnames\":[\"T\",\"M.\",\"Cover\"],\"firstnames\":[\"\"],\"suffixes\":[]}],\"file\":\":papers:ps:worstnoise.pdf\",\"journal\":\"IEEE Transactions on Information Theory\",\"label\":\"dc_j01\",\"month\":\"November\",\"note\":\"\",\"number\":\"7\",\"pages\":\"3072–3081\",\"tags\":\"journal,WorstNoise,RobComm,IT\",\"title\":\"Worst additive noise under covariance constraints\",\"volume\":\"47\",\"year\":\"2001\",\"bibtex\":\"@article{DCj01,\\n abstract = {This paper started with a simple question: is the maximum entropy noise the worst noise for additive channels? In the case of scalar channels with a power constraint\\non the noise, this is true, as is well known. However, we show that in the vector case, with\\ncovariance constraints, the answer is yes and no. Yes, if the transmit power is large enough\\nand no otherwise. Along the way we give a solution to the mutual information game with\\ncovariance constraints and show that Gaussian solutions form saddle points, but there could\\nalso be other saddlepoints. We also demonstrate that the information rates can be achieved\\nusing mismatched (Gaussian) decoders.},\\n author = {S N. Diggavi and T M. Cover,},\\n file = {:papers:ps:worstnoise.pdf},\\n journal = {IEEE Transactions on Information Theory},\\n label = {dc_j01},\\n month = {November},\\n note = {},\\n number = {7},\\n pages = {3072--3081},\\n tags = {journal,WorstNoise,RobComm,IT},\\n title = {Worst additive noise under covariance constraints},\\n type = {2},\\n volume = {47},\\n year = {2001}\\n}\\n\\n\",\"author_short\":[\"Diggavi, S N.\",\"T M. Cover, undefined\"],\"key\":\"DCj01\",\"id\":\"DCj01\",\"bibbaseid\":\"diggavi-tmcover-worstadditivenoiseundercovarianceconstraints-2001\",\"role\":\"author\",\"urls\":{},\"metadata\":{\"authorlinks\":{}},\"html\":\"\"},{\"bibtype\":\"inproceedings\",\"type\":\"4\",\"author\":[{\"firstnames\":[\"S\",\"N.\"],\"propositions\":[],\"lastnames\":[\"Diggavi\"],\"suffixes\":[]},{\"firstnames\":[\"T\",\"M.\"],\"propositions\":[],\"lastnames\":[\"Cover\"],\"suffixes\":[]}],\"booktitle\":\"International Symposium on Information Theory, Ulm\",\"label\":\"dc_c97\",\"month\":\"\",\"note\":\"\",\"pages\":\"278\",\"tags\":\"conf,WorstNoise,RobComm,IT\",\"title\":\"Is Maximum Entropy Noise the Worst?\",\"year\":\"1997\",\"bibtex\":\"@inproceedings{DCj97,\\n author = {S N. Diggavi and T M. Cover},\\n booktitle = {International Symposium on Information Theory, Ulm},\\n label = {dc_c97},\\n month = {},\\n note = {},\\n pages = {278},\\n tags = {conf,WorstNoise,RobComm,IT},\\n title = {Is Maximum Entropy Noise the Worst?},\\n type = {4},\\n year = {1997}\\n}\\n\\n\",\"author_short\":[\"Diggavi, S N.\",\"Cover, T M.\"],\"key\":\"DCj97\",\"id\":\"DCj97\",\"bibbaseid\":\"diggavi-cover-ismaximumentropynoisetheworst-1997\",\"role\":\"author\",\"urls\":{},\"metadata\":{\"authorlinks\":{}},\"html\":\"\"}],\n      metadata: {\"authorlinks\":{}},\n      ownerID: undefined\n    };\n  </script>\n\n  <script type=\"text/javascript\">\n  var site$;\n  if (typeof $ != 'undefined') {\n    console.log('existing jquery: storing and then restoring');\n    site$ = $;\n    $ = null;\n  }\n  </script>\n\n  <script src=\"https://ajax.googleapis.com/ajax/libs/jquery/2.2.4/jquery.min.js\">\n  </script>\n  <script type=\"text/javascript\">\n  if (site$) {\n    console.log('existing jquery: avoiding conflict and restoring');\n    bb$ = $.noConflict(true);\n    $ = site$;\n  } else {\n    bb$ = $;\n  }\n  </script>\n\n  <script src=\"//bibbase.org/js/bibbase.min.js\"\n          type=\"text/javascript\">\n  </script>\n\n  <script type=\"text/javascript\"\n          src=\"https://cdnjs.cloudflare.com/ajax/libs/mathjax/2.7.1/MathJax.js?config=TeX-AMS-MML_HTMLorMML\">\n  </script>\n  <script type=\"text/x-mathjax-config\">\n    MathJax.Hub.Config({tex2jax: {inlineMath: [['$','$'], ['\\\\(','\\\\)']]},\n                        skipTags: [\"body\"],\n                        processClass: \"bibbase_paper\"});\n  </script>\n\n  <style>\n  @media print {\n    .dontprint {\n        display: none !important;\n    }\n\n  .bibbase_group {\n    background-color: #E0E0E0;\n    font-style: italic;\n    font-size: larger;\n    text-shadow: 0px 0px 3px #FFFFFF;\n    border-radius: 4px 4px 4px 4px;\n    -moz-border-radius: 4px 4px 4px 4px;\n    -webkit-border-radius: 4px;\n    padding: 5px 40px 5px;\n    margin-top: 10px;\n    margin-bottom: 5px;\n    cursor: pointer;\n  }\n\n  .bibbase_paper {\n    margin-bottom: 5px;\n  }\n\n  }\n  </style>\n\n  \n  <div style=\"float: right; margin-right: 10px; margin-top: 10px; text-align: right; font-size: 12px\">\n    generated by\n    <a href=\"//bibbase.org\"\n       onclick=\"trackOutboundLink('bibbase', 'logo clicked', window.location.href, '//bibbase.org'); return false;\">\n      <img src=\"//bibbase.org/img/logo.svg\"\n           style=\"vertical-align: middle; margin-left: 3px; height: 16px;\"/\n           alt=\"bibbase.org\"\n           title=\"BibBase – The easiest way to maintain your publications page.\"\n        ></a>\n    \n  </div>\n  \n\n  <div id=\"bibbase_header\" class=\"dontprint\" style=\"\">\n\n    <ul class=\"nav nav-pills\" style=\"margin: 0px;\">\n\n      <li class=\"dropdown\" id=\"groupby_dropdown\">\n      <a class=\"dropdown-toggle\"\n         data-toggle=\"dropdown\"\n         href=\"#\">\n          Group by\n          <b class=\"caret\"></b>\n      </a>\n      <ul class=\"dropdown-menu\">\n        <li class=\"groupby year\"><a onclick=\"groupby('year')\">\n            Year</a>\n        </li>\n        <li class=\"groupby author\"><a onclick=\"groupby('author_short')\">\n            Author</a>\n        </li>\n        <li class=\"groupby type\"><a onclick=\"groupby('type')\">\n            Type</a>\n        </li>\n        <li class=\"groupby keyword\"><a onclick=\"groupby('keyword')\">\n            Keyword</a>\n        </li>\n        <li class=\"groupby downloads\"><a onclick=\"groupby('downloads')\">\n            Downloads</a>\n        </li>\n      </ul>\n      </li>\n\n\n      <li class=\"dropdown\" id=\"menu_dropdown\">\n      <a class=\"dropdown-toggle\"\n         data-toggle=\"dropdown\"\n         href=\"#\" alt=\"controls\">\n          <i class=\"fa fa-reorder\" alt=\"controls\"></i>\n          <b class=\"caret\"></b>\n      </a>\n      <ul class=\"dropdown-menu\">\n        <li>\n          <a onclick=\"toggleAll()\">\n            <i class=\"fa fa-chevron-down fa-fw\"></i> Expand/Collapse All\n          </a>\n        </li>\n        <li>\n          <a download=\"publicactions_v1.bib\" href=\"data:text/bibtex;base64,QGFydGljbGV7QURqMDEsCiBhYnN0cmFjdCA9IHtOYXJyb3diYW5kIGludGVyZmVyZW5jZSAoTkJJKSBjb3VsZCBvY2N1ciBpbiB0cmFuc21pc3Npb24gbWVkaWEgc3VjaCBhcyB0d2lzdGVkIHBhaXIgb3IgY29heGlhbCBjYWJsZS4gV2UgYW5hbHl6ZWQgdGhlIGVmZmVjdCBvZiBzdWNoIGludGVyZmVyZW5jZSBvbiB0aGUgZGF0YSB0aHJvdWdocHV0IGZvciBmaW5pdGUtYmxvY2tsZW5ndGggdHJhbnNtaXNzaW9uIG92ZXIgbm9pc3kgaW50ZXItc3ltYm9sIGludGVyZmVyZW5jZSBjaGFubmVscy4gSXQgd2FzIHNob3duIHRoYXQgdGhlIHdvcnN0IG5hcnJvd2JhbmQgaW50ZXJmZXJlbmNlIHNwcmVhZHMgaXRzIHBvd2VyIG92ZXIgdGhlIOKAnHN3ZWV0IHNwb3Rz4oCdIG9mIHRoZSBzaWduYWwgKGkuZS4gd2hlcmUgdGhlIHNpZ25hbCBwdXRzIGhpZ2hlc3QgcG93ZXIpLiBNb3JlIHByZWNpc2VseSwgdGhlIGF1dG8tY29ycmVsYXRpb24gbWF0cml4IG9mIHdvcnN0LWNhc2UgbmFycm93YmFuZCAocmFuay1kZWZpY2llbnQpIGludGVyZmVyZW5jZSBpcyBzaG93biB0byBoYXZlIHRoZSBzYW1lIGVpZ2VuZGlyZWN0aW9ucyBhcyB0aGUgc2lnbmFsLiBNb3Jlb3ZlciwgaWYgdGhlIHJhbmsgb2YgdGhlIGNvdmFyaWFuY2UgbWF0cml4IG9mIHRoZSBOQkkgaXMgTTxOICh3aGVyZSBOIGlzIHRoZSByYW5rIG9mIHRoZSBzaWduYWwgYW5kIE0gaXMgZGltZW5zaW9uIG9mIHRoZSBzcGFjZSkgdGhlbiB0aGUgd29yc3QgaW50ZXJmZXJlciBpcyBzaG93biB0byBwdXQgaXRzIHBvd2VyIGFsb25nIHRoZSBNIGxhcmdlc3QgZWlnZW5kaXJlY3Rpb25zIG9mIHRoZSBzaWduYWwufSwKIGF1dGhvciA9IHtOLiBBbC1EaGFoaXIgYW5kIFMgTi4gRGlnZ2F2aX0sCiBmaWxlID0gezpwYXBlcnM6cHM6bmJpLnBkZn0sCiBqb3VybmFsID0ge0lFRUUgQ29tbXVuaWNhdGlvbiBMZXR0ZXJzfSwKIGxhYmVsID0ge2FkX2owMX0sCiBtb250aCA9IHtKdW5lfSwKIG5vdGUgPSB7fSwKIG51bWJlciA9IHs2fSwKIHBhZ2VzID0gezIzMy0tMjM1fSwKIHRhZ3MgPSB7am91cm5hbCxXb3JzdE5vaXNlLFJvYkNvbW0sSVR9LAogdGl0bGUgPSB7TWF4aW11bSBUaHJvdWdocHV0IExvc3Mgb2YgTm9pc3kgSVNJIENoYW5uZWxzIER1ZSB0byBOYXJyb3diYW5kIEludGVyZmVyZW5jZX0sCiB0eXBlID0gezJ9LAogdm9sdW1lID0gezV9LAogeWVhciA9IHsyMDAxfQp9CgoKCkBhcnRpY2xle0RDajAxLAogYWJzdHJhY3QgPSB7VGhpcyBwYXBlciBzdGFydGVkIHdpdGggYSBzaW1wbGUgcXVlc3Rpb246IGlzIHRoZSBtYXhpbXVtIGVudHJvcHkgbm9pc2UgdGhlIHdvcnN0IG5vaXNlIGZvciBhZGRpdGl2ZSBjaGFubmVscz8gSW4gdGhlIGNhc2Ugb2Ygc2NhbGFyIGNoYW5uZWxzIHdpdGggYSBwb3dlciBjb25zdHJhaW50Cm9uIHRoZSBub2lzZSwgdGhpcyBpcyB0cnVlLCBhcyBpcyB3ZWxsIGtub3duLiBIb3dldmVyLCB3ZSBzaG93IHRoYXQgaW4gdGhlIHZlY3RvciBjYXNlLCB3aXRoCmNvdmFyaWFuY2UgY29uc3RyYWludHMsIHRoZSBhbnN3ZXIgaXMgeWVzIGFuZCBuby4gWWVzLCBpZiB0aGUgdHJhbnNtaXQgcG93ZXIgaXMgbGFyZ2UgZW5vdWdoCmFuZCBubyBvdGhlcndpc2UuIEFsb25nIHRoZSB3YXkgd2UgZ2l2ZSBhIHNvbHV0aW9uIHRvIHRoZSBtdXR1YWwgaW5mb3JtYXRpb24gZ2FtZSB3aXRoCmNvdmFyaWFuY2UgY29uc3RyYWludHMgYW5kIHNob3cgdGhhdCBHYXVzc2lhbiBzb2x1dGlvbnMgZm9ybSBzYWRkbGUgcG9pbnRzLCBidXQgdGhlcmUgY291bGQKYWxzbyBiZSBvdGhlciBzYWRkbGVwb2ludHMuIFdlIGFsc28gZGVtb25zdHJhdGUgdGhhdCB0aGUgaW5mb3JtYXRpb24gcmF0ZXMgY2FuIGJlIGFjaGlldmVkCnVzaW5nIG1pc21hdGNoZWQgKEdhdXNzaWFuKSBkZWNvZGVycy59LAogYXV0aG9yID0ge1MgTi4gRGlnZ2F2aSBhbmQgVCBNLiBDb3Zlcix9LAogZmlsZSA9IHs6cGFwZXJzOnBzOndvcnN0bm9pc2UucGRmfSwKIGpvdXJuYWwgPSB7SUVFRSBUcmFuc2FjdGlvbnMgb24gSW5mb3JtYXRpb24gVGhlb3J5fSwKIGxhYmVsID0ge2RjX2owMX0sCiBtb250aCA9IHtOb3ZlbWJlcn0sCiBub3RlID0ge30sCiBudW1iZXIgPSB7N30sCiBwYWdlcyA9IHszMDcyLS0zMDgxfSwKIHRhZ3MgPSB7am91cm5hbCxXb3JzdE5vaXNlLFJvYkNvbW0sSVR9LAogdGl0bGUgPSB7V29yc3QgYWRkaXRpdmUgbm9pc2UgdW5kZXIgY292YXJpYW5jZSBjb25zdHJhaW50c30sCiB0eXBlID0gezJ9LAogdm9sdW1lID0gezQ3fSwKIHllYXIgPSB7MjAwMX0KfQoKCgpAaW5wcm9jZWVkaW5nc3tEQ2o5NywKIGF1dGhvciA9IHtTIE4uIERpZ2dhdmkgYW5kIFQgTS4gQ292ZXJ9LAogYm9va3RpdGxlID0ge0ludGVybmF0aW9uYWwgU3ltcG9zaXVtIG9uIEluZm9ybWF0aW9uIFRoZW9yeSwgVWxtfSwKIGxhYmVsID0ge2RjX2M5N30sCiBtb250aCA9IHt9LAogbm90ZSA9IHt9LAogcGFnZXMgPSB7Mjc4fSwKIHRhZ3MgPSB7Y29uZixXb3JzdE5vaXNlLFJvYkNvbW0sSVR9LAogdGl0bGUgPSB7SXMgTWF4aW11bSBFbnRyb3B5IE5vaXNlIHRoZSBXb3JzdD99LAogdHlwZSA9IHs0fSwKIHllYXIgPSB7MTk5N30KfQoK\">\n            <i class=\"fa fa-download fa-fw\"></i> Download BibTeX\n          </a>\n        </li>\n        <li>\n          <a href=\"//bibbase.org/rss?bib=https://research.seas.ucla.edu/licos/files/2023/02/publicactions_v1.bib\">\n            <i class=\"fa fa-rss fa-fw\"></i> RSS Feed\n          </a>\n          </li>\n      </ul>\n      </li>\n\n      \n\n\n      \n    </ul>\n\n\n    <div class=\"alert alert-success bibbase_msg\" id=\"bibbase_msg_embed\"\n         style=\"display: none;\">\n\n      Excellent! Next you can\n      <a href=\"/network/register?next=/network/newSiteFromTemplate%3Fbiburl=https://research.seas.ucla.edu/licos/files/2023/02/publicactions_v1.bib\"\n      >create a new website with this list</a>, or\n      embed it in an existing web page by copying &amp; pasting\n      any of the following snippets.\n\n      <div style=\"text-align: left; margin-top: 1em;\">\n        <strong>JavaScript</strong>\n        <span class=\"comment recommended\">(easiest)</span>\n        <div class=\"well well-small\">\n          <code>\n            &lt;script src=\"https://bibbase.org/show?bib=https%3A%2F%2Fresearch.seas.ucla.edu%2Flicos%2Ffiles%2F2023%2F02%2Fpublicactions_v1.bib&amp;authorFirst=1&amp;nocache=1&amp;fullnames=1&amp;theme=bullets&amp;group0=year&amp;group1=type&amp;owner={}&amp;filter=label:(dc_j01|dc_c97|ad_j01)&amp;jsonp=1&amp;jsonp=1\"&gt;&lt;/script&gt;\n          </code>\n        </div>\n\n        <strong>PHP</strong>\n        <div class=\"well well-small\">\n          <code>\n            &lt;?php\n            $contents = file_get_contents(\"https://bibbase.org/show?bib=https%3A%2F%2Fresearch.seas.ucla.edu%2Flicos%2Ffiles%2F2023%2F02%2Fpublicactions_v1.bib&amp;authorFirst=1&amp;nocache=1&amp;fullnames=1&amp;theme=bullets&amp;group0=year&amp;group1=type&amp;owner={}&amp;filter=label:(dc_j01|dc_c97|ad_j01)&amp;jsonp=1\");\n            print_r($contents);\n            ?&gt;\n          </code>\n        </div>\n\n        <strong>iFrame</strong>\n        <span class=\"comment\">(not recommended)</span>\n        <div class=\"well well-small\">\n          <code>\n            &lt;iframe src=\"https://bibbase.org/show?bib=https%3A%2F%2Fresearch.seas.ucla.edu%2Flicos%2Ffiles%2F2023%2F02%2Fpublicactions_v1.bib&amp;authorFirst=1&amp;nocache=1&amp;fullnames=1&amp;theme=bullets&amp;group0=year&amp;group1=type&amp;owner={}&amp;filter=label:(dc_j01|dc_c97|ad_j01)&amp;jsonp=1\"&gt;&lt;/iframe&gt;\n          </code>\n        </div>\n\n        <p>\n          For more details see the <a href=\"//bibbase.org/help\">documention</a>.\n        </p>\n      </div>\n    </div>\n\n    <div class=\"alert alert-success bibbase_msg\" id=\"bibbase_msg_preview\"\n         style=\"display: none;\">\n\n      This is a preview! To use this list on your own web site\n      or create a new web site from it,\n      <a href=\"/network/register?next=/network/newAccountWithFile%3FfileId=\"\n      >create a free account</a>. The file will be added\n      and you will be able to edit it in the File Manager.\n      We will show you instructions once you've created your account.\n    </div>\n\n    <div class=\"alert alert-warning bibbase_msg\" id=\"bibbase_msg_mendeley1\"\n         style=\"display: none;\">\n\n      <p>To the site owner:</p>\n\n      <p><strong>Action required!</strong> Mendeley is changing its\n        API. In order to keep using Mendeley with BibBase past April\n        14th, you need to:\n        <ol>\n          <li>renew the authorization for BibBase on Mendeley, and</li>\n          <li>update the BibBase URL\n            in your page the same way you did when you initially set up\n            this page.\n          </li>\n        </ol>\n      </p>\n\n      <p>\n        <a href=\"http://bibbase.org/cgi-bin/mendeley2/get.py\">\n          <i class=\"fa fa-angle-double-right\"></i>\n          Fix it now</a>\n      </p>\n    </div>\n\n  </div>\n\n\n  <div id=\"bibbase_body\">\n    \n  \n  <div class=\"bibbase_group_whole\" id=\"group_2001\">\n    <div class=\"bibbase_group\"\n      onclick=\"toggleGroup('group_2001')\"\n      onkeypress=\"toggleGroup('group_2001')\"\n      tabindex=\"0\">\n      <i class=\"fa fa-angle-down bibbase_group_head_icon\"></i>&nbsp;\n      <span>2001</span>\n      <span class=\"bibbase_group_count\">\n        \n        (1)\n        \n      </span>\n    </div>\n    <div class=\"bibbase_group_body\">\n      \n  \n  <div class=\"bibbase_group_whole\" id=\"group_2\">\n    <div class=\"bibbase_group\"\n      onclick=\"toggleGroup('group_2')\"\n      onkeypress=\"toggleGroup('group_2')\"\n      tabindex=\"0\">\n      <i class=\"fa fa-angle-down bibbase_group_head_icon\"></i>&nbsp;\n      <span>2</span>\n      <span class=\"bibbase_group_count\">\n        \n        (2)\n        \n      </span>\n    </div>\n    <div class=\"bibbase_group_body\">\n      \n  \n  <div class=\"bibbase_paper\" id=\"aldhahir-diggavi-maximumthroughputlossofnoisyisichannelsduetonarrowbandinterference-2001\">\n  <span class=\"bibbase_paper_titleauthoryear\">\n\n  \n  <span class=\"bibbase_paper_author\">\n   N. Al-Dhahir;  and  S N. Diggavi.\n</span>\n\n  <span class=\"bibbase_paper_title\">\n  \n  \n  \n  Maximum Throughput Loss of Noisy ISI Channels Due to Narrowband Interference.\n  \n  \n  \n</span>\n\n  \n\n</span>\n\n  <i>IEEE Communication Letters</i>, 5(6): 233–235. June 2001.\n  <span class=\"note\"></span>\n\n<span class=\"bibbase_note\"></span>\n\n<br class=\"bibbase_paper_content\"/>\n\n<span class=\"bibbase_paper_content dontprint\">\n\n  \n\n  \n\n  \n  <a href=\"//bibbase.org/network/publication/aldhahir-diggavi-maximumthroughputlossofnoisyisichannelsduetonarrowbandinterference-2001\"\n     class=\"bibbase bibbase_page link\">link</a>\n  &nbsp;\n  \n\n  <a href=\"#\"\n     onclick=\"showBib(event); return false;\"\n     class=\"bibbase bibtex link\">bibtex\n    <i class=\"fa fa-caret-down\"></i></a>\n\n  \n  &nbsp;\n  <a class=\"bibbase_abstract_link bibbase link\"\n     href=\"#\"\n     onclick=\"showAbstract(event); return false;\">\n    abstract <i class=\"fa fa-caret-down\"></i></a>\n  \n\n  \n\n  <!-- <a class=\"bibbase read link hidden\" -->\n  <!--    href=\"javascript:toggleRead('aldhahir-diggavi-maximumthroughputlossofnoisyisichannelsduetonarrowbandinterference-2001')\" -->\n  <!--    title=\"Marking this paper as read adds it to your library on BibBase.\" -->\n  <!--    > -->\n  <!--   <i class=\"fa fa-check\"></i>&nbsp; -->\n  <!--   <span>mark as read</span> -->\n  <!-- </a> -->\n\n  &nbsp;\n  \n  \n\n</span>\n\n<div class=\"well well-small bibbase\" data-type=\"bibtex\"\n     style=\"display:none\">\n  <pre style=\"white-space: pre-wrap;\">@article{ADj01,\n abstract = {Narrowband interference (NBI) could occur in transmission media such as twisted pair or coaxial cable. We analyzed the effect of such interference on the data throughput for finite-blocklength transmission over noisy inter-symbol interference channels. It was shown that the worst narrowband interference spreads its power over the “sweet spots” of the signal (i.e. where the signal puts highest power). More precisely, the auto-correlation matrix of worst-case narrowband (rank-deficient) interference is shown to have the same eigendirections as the signal. Moreover, if the rank of the covariance matrix of the NBI is M&lt;N (where N is the rank of the signal and M is dimension of the space) then the worst interferer is shown to put its power along the M largest eigendirections of the signal.},\n author = {N. Al-Dhahir and S N. Diggavi},\n file = {:papers:ps:nbi.pdf},\n journal = {IEEE Communication Letters},\n label = {ad_j01},\n month = {June},\n note = {},\n number = {6},\n pages = {233--235},\n tags = {journal,WorstNoise,RobComm,IT},\n title = {Maximum Throughput Loss of Noisy ISI Channels Due to Narrowband Interference},\n type = {2},\n volume = {5},\n year = {2001}\n}\n\n</pre>\n</div>\n\n\n<div class=\"well well-small bibbase\" data-type=\"abstract\"\n     style=\"display:none\">\n  Narrowband interference (NBI) could occur in transmission media such as twisted pair or coaxial cable. We analyzed the effect of such interference on the data throughput for finite-blocklength transmission over noisy inter-symbol interference channels. It was shown that the worst narrowband interference spreads its power over the “sweet spots” of the signal (i.e. where the signal puts highest power). More precisely, the auto-correlation matrix of worst-case narrowband (rank-deficient) interference is shown to have the same eigendirections as the signal. Moreover, if the rank of the covariance matrix of the NBI is M<N (where N is the rank of the signal and M is dimension of the space) then the worst interferer is shown to put its power along the M largest eigendirections of the signal.\n</div>\n\n\n</div>\n\n\n  <div class=\"bibbase_paper\" id=\"diggavi-tmcover-worstadditivenoiseundercovarianceconstraints-2001\">\n  <span class=\"bibbase_paper_titleauthoryear\">\n\n  \n  <span class=\"bibbase_paper_author\">\n   S N. Diggavi;  and   T M. Cover.\n</span>\n\n  <span class=\"bibbase_paper_title\">\n  \n  \n  \n  Worst additive noise under covariance constraints.\n  \n  \n  \n</span>\n\n  \n\n</span>\n\n  <i>IEEE Transactions on Information Theory</i>, 47(7): 3072–3081. November 2001.\n  <span class=\"note\"></span>\n\n<span class=\"bibbase_note\"></span>\n\n<br class=\"bibbase_paper_content\"/>\n\n<span class=\"bibbase_paper_content dontprint\">\n\n  \n\n  \n\n  \n  <a href=\"//bibbase.org/network/publication/diggavi-tmcover-worstadditivenoiseundercovarianceconstraints-2001\"\n     class=\"bibbase bibbase_page link\">link</a>\n  &nbsp;\n  \n\n  <a href=\"#\"\n     onclick=\"showBib(event); return false;\"\n     class=\"bibbase bibtex link\">bibtex\n    <i class=\"fa fa-caret-down\"></i></a>\n\n  \n  &nbsp;\n  <a class=\"bibbase_abstract_link bibbase link\"\n     href=\"#\"\n     onclick=\"showAbstract(event); return false;\">\n    abstract <i class=\"fa fa-caret-down\"></i></a>\n  \n\n  \n\n  <!-- <a class=\"bibbase read link hidden\" -->\n  <!--    href=\"javascript:toggleRead('diggavi-tmcover-worstadditivenoiseundercovarianceconstraints-2001')\" -->\n  <!--    title=\"Marking this paper as read adds it to your library on BibBase.\" -->\n  <!--    > -->\n  <!--   <i class=\"fa fa-check\"></i>&nbsp; -->\n  <!--   <span>mark as read</span> -->\n  <!-- </a> -->\n\n  &nbsp;\n  \n  \n\n</span>\n\n<div class=\"well well-small bibbase\" data-type=\"bibtex\"\n     style=\"display:none\">\n  <pre style=\"white-space: pre-wrap;\">@article{DCj01,\n abstract = {This paper started with a simple question: is the maximum entropy noise the worst noise for additive channels? In the case of scalar channels with a power constraint\non the noise, this is true, as is well known. However, we show that in the vector case, with\ncovariance constraints, the answer is yes and no. Yes, if the transmit power is large enough\nand no otherwise. Along the way we give a solution to the mutual information game with\ncovariance constraints and show that Gaussian solutions form saddle points, but there could\nalso be other saddlepoints. We also demonstrate that the information rates can be achieved\nusing mismatched (Gaussian) decoders.},\n author = {S N. Diggavi and T M. Cover,},\n file = {:papers:ps:worstnoise.pdf},\n journal = {IEEE Transactions on Information Theory},\n label = {dc_j01},\n month = {November},\n note = {},\n number = {7},\n pages = {3072--3081},\n tags = {journal,WorstNoise,RobComm,IT},\n title = {Worst additive noise under covariance constraints},\n type = {2},\n volume = {47},\n year = {2001}\n}\n\n</pre>\n</div>\n\n\n<div class=\"well well-small bibbase\" data-type=\"abstract\"\n     style=\"display:none\">\n  This paper started with a simple question: is the maximum entropy noise the worst noise for additive channels? In the case of scalar channels with a power constraint on the noise, this is true, as is well known. However, we show that in the vector case, with covariance constraints, the answer is yes and no. Yes, if the transmit power is large enough and no otherwise. Along the way we give a solution to the mutual information game with covariance constraints and show that Gaussian solutions form saddle points, but there could also be other saddlepoints. We also demonstrate that the information rates can be achieved using mismatched (Gaussian) decoders.\n</div>\n\n\n</div>\n\n\n\n\n\n    </div>\n  </div>\n\n\n\n\n    </div>\n  </div>\n\n  <div class=\"bibbase_group_whole\" id=\"group_1997\">\n    <div class=\"bibbase_group\"\n      onclick=\"toggleGroup('group_1997')\"\n      onkeypress=\"toggleGroup('group_1997')\"\n      tabindex=\"0\">\n      <i class=\"fa fa-angle-down bibbase_group_head_icon\"></i>&nbsp;\n      <span>1997</span>\n      <span class=\"bibbase_group_count\">\n        \n        (1)\n        \n      </span>\n    </div>\n    <div class=\"bibbase_group_body\">\n      \n  \n  <div class=\"bibbase_group_whole\" id=\"group_4\">\n    <div class=\"bibbase_group\"\n      onclick=\"toggleGroup('group_4')\"\n      onkeypress=\"toggleGroup('group_4')\"\n      tabindex=\"0\">\n      <i class=\"fa fa-angle-down bibbase_group_head_icon\"></i>&nbsp;\n      <span>4</span>\n      <span class=\"bibbase_group_count\">\n        \n        (1)\n        \n      </span>\n    </div>\n    <div class=\"bibbase_group_body\">\n      \n  \n  <div class=\"bibbase_paper\" id=\"diggavi-cover-ismaximumentropynoisetheworst-1997\">\n  <span class=\"bibbase_paper_titleauthoryear\">\n\n  \n  <span class=\"bibbase_paper_author\">\n   S N. Diggavi;  and  T M. Cover.\n</span>\n\n  <span class=\"bibbase_paper_title\">\n  \n  \n  \n  Is Maximum Entropy Noise the Worst?.\n  \n  \n  \n</span>\n\n  \n\n</span>\n\n  In <i>International Symposium on Information Theory, Ulm</i>, pages 278,  1997. \n  <span class=\"note\"></span>\n\n<span class=\"bibbase_note\"></span>\n\n<br class=\"bibbase_paper_content\"/>\n\n<span class=\"bibbase_paper_content dontprint\">\n\n  \n\n  \n\n  \n  <a href=\"//bibbase.org/network/publication/diggavi-cover-ismaximumentropynoisetheworst-1997\"\n     class=\"bibbase bibbase_page link\">link</a>\n  &nbsp;\n  \n\n  <a href=\"#\"\n     onclick=\"showBib(event); return false;\"\n     class=\"bibbase bibtex link\">bibtex\n    <i class=\"fa fa-caret-down\"></i></a>\n\n  \n\n  \n\n  <!-- <a class=\"bibbase read link hidden\" -->\n  <!--    href=\"javascript:toggleRead('diggavi-cover-ismaximumentropynoisetheworst-1997')\" -->\n  <!--    title=\"Marking this paper as read adds it to your library on BibBase.\" -->\n  <!--    > -->\n  <!--   <i class=\"fa fa-check\"></i>&nbsp; -->\n  <!--   <span>mark as read</span> -->\n  <!-- </a> -->\n\n  &nbsp;\n  \n  \n\n</span>\n\n<div class=\"well well-small bibbase\" data-type=\"bibtex\"\n     style=\"display:none\">\n  <pre style=\"white-space: pre-wrap;\">@inproceedings{DCj97,\n author = {S N. Diggavi and T M. Cover},\n booktitle = {International Symposium on Information Theory, Ulm},\n label = {dc_c97},\n month = {},\n note = {},\n pages = {278},\n tags = {conf,WorstNoise,RobComm,IT},\n title = {Is Maximum Entropy Noise the Worst?},\n type = {4},\n year = {1997}\n}\n\n</pre>\n</div>\n\n\n\n</div>\n\n\n\n\n\n    </div>\n  </div>\n\n\n\n\n    </div>\n  </div>\n\n\n\n\n  </div>\n\n\n  <!-- Modal -->\n\n  <!-- <iframe id=\"bibbase_network_frame\" -->\n  <!--         src=\"//bibbase.org/network/control\" -->\n  <!--         style=\"display: none;\"> -->\n  <!-- </iframe> -->\n\n</div>\n"}; document.write(bibbase_data.data);